Lattice valued intuitionistic fuzzy sets

In this paper a new definition of a lattice valued intuitionistic fuzzy set (LIFS) is introduced, in an attempt to overcome the disadvantages of earlier definitions. Some properties of this kind of fuzzy sets and their basic operations are given. The theorem of synthesis is proved: For every two families of subsets of a set satisfying certain conditions, there is an lattice valued intuitionistic fuzzy set for which these are families of level sets. The research supported by Serbian Ministry of Science and Technology, Grant No. 1227.     

On the multidimensional distribution of the subset sum generator of pseudorandom numbers

We show that for a random choice of the parameters, the subset sum pseudorandom number generator produces a sequence of uniformly and independently distributed pseudorandom numbers. The result can be useful for both cryptographic and quasi-Monte Carlo applications and relies on bounds of exponential sums.

     

Lanthanum nitrate decomposition by both temperature programmed heating and citrate gel combustion

Thermal decomposition of lanthanum nitrate to lanthanum oxide was carried out by both temperature programmed heating (TPH) and citrate-gel combustion. The temperature programmed heating was carried out under flow of oxidizing (air), neutral (nitrogen) and reducing (25 vol.% hydrogen+argone mixture) gases, and the processes were controlled by simultaneous thermogravimetry and differential thermal analysis. It was shown that hydrogen atmosphere helps to reduce temperatures of all decomposition steps. The results of TPH were utilized to check the nature of residues in the products of lanthanum nitrate-to-oxide conversion performed via citrate-gel combustion technique.     

Precipitation and characterization of uniform submicrometer lead titanate particles. Part II: Reaction mechanism

The chemical mechanism of the precipitation of lead titanium peroxohydroxide particles in a solution of nitrilotriacetate (NTA) complexes of lead and titanium peroxo-hydroxide is envisioned as the interaction between cations of lead hydroxide and anions of polymeric titanium peroxo-hydroxide.     

Arithmetic functions with linear recurrence sequences

We obtain asymptotic formulas for all the moments of certain arithmetic functions with linear recurrence sequences. We also apply our results to obtain asymptotic formulas for some mean values related to average orders of elements in finite fields.     

Electrocatalytic activity of sol-gel-prepared RuO2/Ti anode in chlorine and oxygen evolution reactions

Electrocatalytic properties of RuO₂/Ti anode with different coating masses, which are prepared by the alkoxide sol-gel procedure, are investigated in chlorine and oxygen evolution reactions by polarization measurements and electrochemical impedance spectroscopy in H₂SO₄ and NaCl electrolytes. According to polarization measurements, the activity of anodes at overpotentials below 100 mV is independent of coating mass. However, impedance measurements above 100 mV reveal changes in the activity of anodes in chlorine evolution reaction for different coating masses. The diffusion limitations related to the evolved chlorine are registered in low-frequency domain at 1.10 V (SCE), diminishing with the increase in potential to the 1.15 V (SCE). The observed impedance behavior is discussed with respect to the activity model for activated titanium anodes in chlorine evolution reaction involving formation of gas channels within porous coating structure. Gas channels enhance the mass transfer rate similarly to the forced convection, which also increases the activity of anode. This is more pronounced for the anode of greater coating mass due to its more compact surface structure. The more compact structure appears to be beneficial for gas channels formation. Published in Russian in Elektrokhimiya, 2006, Vol. 42, No. 10, pp. 1173–1179. The text was submitted by the authors in English.     

Renormalisation group calculation of the interfacial tension for the three-dimensional Ising model

The interfacial tension of a three-dimensional Ising model in the whole temperature region is calculated by the real-space renormalisation group methods. The cumulant and the finite-cluster approximations with different projection rules are used. The results are consistent with expected low-temperature and global behaviour of the interfacial tension in the three-dimensional model.     

Computing Aviation Sparing Policies: Solving a Large Nonlinear Integer Program

Deployed US Navy aircraft carriers must stock a large number of spare parts to support the various types of aircraft embarked on the ship. The sparing policy determines the spares that will be stocked on the ship to keep the embarked aircraft ready to fly. Given a fleet of ten or more aircraft carriers and a cost of approximately 50 million dollars per carrier plus the cost of spares maintained in warehouses in the United States, the sparing problem constitutes a significant portion of the Navy’s resources. The objective of this work is to find a minimum-cost sparing policy that meets the readiness requirements of the embarked aircraft. This is a very large, nonlinear, integer optimization problem. The cost function is piecewise linear and convex while the constraint mapping is highly nonlinear. The distinguishing characteristics of this problem from an optimization viewpoint are that a large number of decision variables are required to be integer and that the nonlinear constraint functions are essentially “black box” functions; that is, they are very difficult (and expensive) to evaluate and their derivatives are not available. Moreover, they are not convex. Integer programming problems with a large number of variables are difficult to solve in general and most successful approaches to solving nonlinear integer problems have involved linear approximation and relaxation techniques that, because of the complexity of the constraint functions, are inappropriate for attacking this problem. We instead employ a pattern search method to each iteration of an interior point-type algorithm to solve the relaxed version of the problem. From the solution found by the pattern search on each interior point iteration, we begin another pattern search on the integer lattice to find a good integer solution. The best integer solution found across all interations is returned as the optimal solution. The pattern searches are distributed across a local area network of non-dedicated, heterogeneous computers in an office environment, thus, drastically reducing the time required to find the solution.